directionally n-signed graphs-iii: the notion of symmetric balance

let $g=(v, e)$ be a graph. by emph{directional labeling (ord-labeling)} of an edge $x=uv$ of $g$ by an ordered $n$-tuple$(a_1,a_2,...,a_n)$, we mean a labeling of the edge $x$ such thatwe consider the label on $uv$ as $(a_1,a_2,...,a_n)$ in thedirection from $u$ to $v$, and the label on $x$ as$(a_{n},a_{n-1},...,a_1)$ in the direction from $v$ to $u$. inthis paper, we study graphs, called emph{(n, d)-sigraphs}, inwhich every edge is $d$-labeled by an $n$-tuple$(a_1,a_2,...,a_n)$, where $a_k in {+,-}$, for $1leq k leqn$. in this paper, we give different notion of balance: symmetricbalance in a $(n,d)$-sigraph and obtain some characterizations.